Regular and compositional aspects of NPN constructions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

Constructions of bi-regular cages

Given three positive integers r,m and g, one interesting question is the following: What is the minimum number of vertices that a graph with prescribed degree set {r,m}, 2 ≤ r < m, and girth g can have? Such a graph is called a bi-regular cage or an ({r,m}; g)-cage, and its minimum order is denoted by n({r,m}; g). In this paper we provide new upper bounds on n({r,m}; g) for some related values ...

متن کامل

Constructions of Bipartite and Bipartite-regular Hypermaps

A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is bipartiteregular if its set of automorphisms is transitive on A and on B. In this paper we see some properties of the constructions of bipartite hypermaps desc...

متن کامل

Pragmatic Aspects of Grammatical Constructions

1. Introduction. Constructions and Pragmatics What do constructional approaches to grammar have to contribute to linguistic pragmatics? A careful answer to this question would require prior specification of which approaches should properly be called 'constructional' and also what exactly is intended by 'linguistic pragmatics'. Conscientiously discharging these preparatory obligations could requ...

متن کامل

The Compositional Method and Regular Reachability

The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its factors. It applies to first-order logic, and limitations for its use have recently been revealed by Rabinovich (2007). We sharpen the results of Rabinovich by showing that the composition method is applicable to the async...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Linguistics

سال: 2021

ISSN: 0022-2267,1469-7742

DOI: 10.1017/s0022226721000116